Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
نویسندگان
چکیده
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has been proved that the reachability problem is decidable. We prove here that boundedness, termination and reversal-boundedness are decidable for VASS with one zero-test. To decide reversal-boundedness, we provide an original method which mixes both the construction of the coverability graph for VASS and the computation of the reachability set of reversal-bounded counter machines. The same construction can be slightly adapted to decide boundedness and hence termination.
منابع مشابه
Finkel , Alain and Sangnier , Arnaud Mixing coverability and reachability to analyze VASS with one zero - test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has been proved that the reachability problem is decidable. We prove here that boundedness, termination and reversal-boundedness are decidable for VASS with one zero-test. To decide reversal-boundedness, we provide an origin...
متن کاملInteger Vector Addition Systems with States
This paper studies reachability, coverability and inclusion problems for Integer Vector Addition Systems with States (Z-VASS) and extensions and restrictions thereof. A Z-VASS comprises a finite-state controller with a finite number of counters ranging over the integers. Although it is folklore that reachability in Z-VASS is NP-complete, it turns out that despite their naturalness, from a compl...
متن کاملA Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
Branching VASS (BVASS) generalise vector addition systems with states by allowing for special branching transitions that can non-deterministically distribute a counter value between two control states. A run of a BVASS consequently becomes a tree, and reachability is to decide whether a given configuration is the root of a reachability tree. This paper shows P-completeness of reachability in BV...
متن کاملMinimal Cost Reachability/Coverability in Priced Timed Petri Nets
We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.
متن کاملKarp-Miller Trees for a Branching Extension of VASS
We study BVASS (Branching VASS) which extend VASS (Vector Addition Systems with States) by allowing addition transitions that merge two configurations. Runs in BVASS are tree-like structures instead of linear ones as for VASS. We show that the construction of Karp-Miller trees for VASS can be extended to BVASS. This entails that the coverability set for BVASS is computable.
متن کامل